An on-line approach to hybrid flow shop scheduling with jobs arriving over time
نویسنده
چکیده
During the manufacturing process in a steel mill, the chemical composition and quality of raw-iron, steel and slack has to be checked several times. The organization of the corresponding list of operations can be classified as a hybrid flow shop scheduling problem with jobs arriving over time and the objective is to minimize the total weighted completion time. Since this problem is known to be NP-hard, we deal with heuristic solution techniques to accomplish the required on-line optimization. To this end, we develop and evaluate a hybrid approach based on dispatching rules and bottleneck related strategies.
منابع مشابه
A Hybrid Approach for Fuzzy Just-In-Time Flow Shop Scheduling with Limited Buffers and Deteriorating Jobs
This paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. The fuzzy set theory is applied to describe this situation. A novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. Due to the computational complexities, the prop...
متن کاملA novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem
Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...
متن کاملHeuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...
متن کاملScheduling on flexible flow shop with cost-related objective function considering outsourcing options
This study considers outsourcing decisions in a flexible flow shop scheduling problem, in which each job can be processed by either an in-house production line or outsourced. The selected objective function aims to minimize the weighted sum of tardiness costs, in-house production costs, and outsourcing costs with respect to the jobs due date. The purpose of the problem is to select the jobs tha...
متن کاملHeuristic Approach for Specially Structured Two Stage Flow Shop Scheduling to Minimize the Rental Cost, Processing Time, Set Up Time Are Associated with Their Probabilities Including Transportation Time and Job Weightage
The present paper is an attempt to develop a new heuristic algorithm, find the optimal sequence to minimize the utilization time of the machines and hence their rental cost for two stage specially structured flow shop scheduling under specified rental policy in which processing times and set up time are associated with their respective probabilities including transportation time. Further jo...
متن کامل